Перевод: со всех языков на русский

с русского на все языки

tree derivation

См. также в других словарях:

  • Derivation — may refer to: Derivation (abstract algebra), a function on an algebra which generalizes certain features of the derivative operator Derivation (linguistics) Derivation in differential algebra, a unary function satisfying the Leibniz product law… …   Wikipedia

  • Tree-adjoining grammar — (TAG) is a grammar formalism defined by Aravind Joshi. Tree adjoining grammars are somewhat similar to context free grammars, but the elementary unit of rewriting is the tree rather than the symbol. Whereas context free grammars have rules for… …   Wikipedia

  • derivation tree — išvedimo medis statusas T sritis informatika apibrėžtis ↑Medžio pavidalo reiškinio orientuotasis grafas. Jo viršūnėms priskirti loginio skaičiavimo reiškiniai tenkina sąlygas: medžio šaknį atitinka pradinis reiškinys, lapus – aksiomos, o… …   Enciklopedinis kompiuterijos žodynas

  • cumball tree — noun Alternate name for the Osage Orange tree. See cumball for derivation …   Wiktionary

  • Context-free grammar — In formal language theory, a context free grammar (CFG) is a formal grammar in which every production rule is of the form V → w where V is a single nonterminal symbol, and w is a string of terminals and/or nonterminals (w can be empty). The… …   Wikipedia

  • Grammaire d'arbres adjoints — La grammaire d arbres adjoints, grammaire TAG, ou légèrement sensible au contexte est un formalisme d analyse grammaticale introduit par A.K. Joshi et ses collègues[1] en 1975. Ce formalisme a été utilisé à différentes fins, et particulièrement… …   Wikipédia en Français

  • Natural deduction — In logic and proof theory, natural deduction is a kind of proof calculus in which logical reasoning is expressed by inference rules closely related to the natural way of reasoning. This contrasts with the axiomatic systems which instead use… …   Wikipedia

  • First-order logic — is a formal logical system used in mathematics, philosophy, linguistics, and computer science. It goes by many names, including: first order predicate calculus, the lower predicate calculus, quantification theory, and predicate logic (a less… …   Wikipedia

  • SKI combinator calculus — is a computational system that is a reduced, untyped version of Lambda calculus. All operations in Lambda calculus are expressed in SKI as binary trees whose leaves are one of the three symbols S, K, and I (called combinators). In fact, the… …   Wikipedia

  • Many-worlds interpretation — The quantum mechanical Schrödinger s cat paradox according to the many worlds interpretation. In this interpretation every event is a branch point; the cat is both alive and dead, even before the box is opened, but the alive and dead cats are in… …   Wikipedia

  • Generalizations of the derivative — The derivative is a fundamental construction of differential calculus and admits many possible generalizations within the fields of mathematical analysis, combinatorics, algebra, and geometry. Contents 1 Derivatives in analysis 1.1 Multivariable… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»